interview questions:

1. given a directory, list all unique filenames inside that directory, in minimum time.

2. Find least common ancestor in BST and then in binary tree.

3. Design an algorithm to search a given string in a large String. (interviewer want a method apart from trivial, he was not even satisfied with KMP search, he wanted some new method, no bounds for space.)

4. 100 doors problem.

5. some questions regarding memory allocation, like where is memory allocated for the value returned from a function.

HAVE YOUR SAY...